#include <bits/stdc++.h>
#define int long long
using namespace std;

inline int read() {
	int x = 0, f = 0; char ch = getchar();
	while (ch < '0' or ch > '9') f |= (ch == '-'), ch = getchar();
	while (ch >= '0' and ch <= '9') x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
	return f ? -x : x;
}

int __stk[128], __top;
inline void write(int x) {
    if(x < 0) putchar('-'), x = -x;
	do { __stk[++__top] = x % 10, x /= 10; } while (x);
	while (__top) putchar(__stk[__top--] + '0');
}

const int mod = 998244353;

void Min(int &x, int y) { y < x and (x = y); }
void Max(int &x, int y) { y > x and (x = y); }

void inc(int &x, int y) { (x += y) >= mod and (x -= mod); }
void mul(int &x, int y) { x = 1ll * x * y % mod; }

int q_pow(int x, int k) { int res = 1; for (; k; k >>= 1, mul(x, x)) if (k & 1) mul(res, x); return res; }

bool stmer;

const int N = 3e5 + 10;

int n, m, q;
int a[N];

int work(int l, int r) {
    int ans = 0, tot = 0; queue<pair<int, int>> q;
    for (int i = l; i <= r; i++) {
        while (!q.empty() and q.front().first == i) tot -= q.front().second, q.pop();
        while (tot > a[i]) {
            if (tot - a[i] >= q.front().second) tot -= q.front().second, q.pop();
            else q.front().second -= tot - a[i], tot = a[i];
        }
        if (tot < a[i]) ans += a[i] - tot, q.push({ i + m, a[i] - tot }), tot = a[i];
    }
    return ans;
}

bool edmer;
signed main() {
	freopen("clear.in", "r", stdin);
	freopen("clear.out", "w", stdout);
	cerr << "[Memory] " << (&stmer - &edmer) / 1024 / 1024 << " MB\n";
    
    n = read(), m = read(), q = read();
    for (int i = 1; i <= n; i++) a[i] = read();

    for (int i = 1; i <= q; i++) {
        int l = read(), r = read();
        write(work(l, r)), putchar('\n');
    }

    cerr << "[Runtime] " << (double) clock() / CLOCKS_PER_SEC << " seconds\n";
	return 0;
} 